Clausal Intuitionistic Logic II - Tableau Proof Procedures
نویسنده
چکیده
D Clausal intuitionistic logic is an extension of Horn-clause logic which permits the appearance of negations and embedded implications on the right-hand side of a rule, and interprets these new rules intuitionistically in a set of partial models. In this article the second of a pair, clausal intuitionistic logic, is shown to have a tableau proof procedure that generalizes Horn-clause refutation proofs. The proof procedures are explained by means of several detailed examples. Soundness and completeness theorems are stated and proven in full detail. a
منابع مشابه
leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
leanCoP is a very compact theorem prover for classical firstorder logic, based on the connection (tableau) calculus and implemented in Prolog. leanCoP 2.0 enhances leanCoP 1.0 by adding regularity, lemmata, and a technique for restricting backtracking. It also provides a definitional translation into clausal form and integrates “Prolog technology” into a lean theorem prover. ileanCoP is a compa...
متن کاملFrom Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction
We define a translation that maps higher-order formulas provable in a classical extensional setting to semantically equivalent formulas provable in an intuitionistic intensional setting. For the classical extensional higher-order proof system we define a Henkincomplete tableau calculus. For the intuitionistic intensional higher-order proof system we give a natural deduction calculus. We prove t...
متن کاملA Tableau-Based Theorem Proving Method for Intuitionistic Logic
A new tableau-based calculus for first-order intuitionistic logic is proposed. The calculus is obtained from the tableau calculus for classical logic by extending its rules by A-terms. Aterms are seen as compact representation of natural deduction proofs. The benefits from that approach are two-fold. First, proof search methods known for classical logic can be adopted: Run-time-Skolemization an...
متن کاملA Non-clausal Connection Calculus
A non-clausal connection calculus for classical first-order logic is presented that does not require the translation of input formulae into any clausal form. The definition of clauses is generalized, which may now also contain (sub-) matrices. Copying of appropriate (sub-)clauses in a dynamic way, i.e. during the actual proof search, is realized by a generalized extension rule. Thus, the calcul...
متن کاملTableau methods of proof for modal logics
1 Introduction: In [1] Fitch proposed a new proof proceedure for several standard modal logics. The chief characteristic of this was the inclusion in the object language, of symbols representing worlds in Kripke models. In this paper we incorporate the device into a tableau proof system and it is seen that the resulting (propositional) proof system is highly analogous to a classical first order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 5 شماره
صفحات -
تاریخ انتشار 1988